Implicit Computational Complexity ESSLLI 2010 CPH
نویسنده
چکیده
منابع مشابه
A Short Introduction to Implicit Computational Complexity
These lecture notes are meant to serve as a short introduction to implicit computational complexity for those students who have little or no knowledge of recursion theory and proof theory. They have been obtained by enriching and polishing a set of notes the author wrote for a course (on the same subject) he gave at ESSLLI 2010. These notes are definitely not meant to be comprehensive nor exhau...
متن کاملA Generalized Quantifier Concept in Computational Complexity Theory
A notion of generalized quantifier in computational complexity theory is explored and used to give a unified treatment of leaf language definability, oracle separations, type 2 operators, and circuits with monoidal gates. Relations to Lindström quantifiers are pointed out.
متن کاملImplicit characterizations of FPTIME and NC revisited
Various simpli ed or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in simplifying the required simulations of various recursion schemes in the corresponding (implicit) framework, and in developing those simulations in a more uniform way, based on a step-by-step comparison technique, thus con...
متن کاملQuantum implicit computational complexity
We introduce a quantum lambda calculus inspired by Lafont’s Soft Linear Logic and capturing the polynomial quantum complexity classes EQP, BQP and ZQP. The calculus is based on the ‘‘classical control and quantum data’’ paradigm. This is the first example of a formal systemcapturing quantumcomplexity classes in the spirit of implicit computational complexity — it is machine-free and no explicit...
متن کاملLogic in Milan
Speaker: Marco Gaboardi (Bologna) Title: Light Logics: a tool for polynomial time in functional programming Abstract: We overview the Light Logics approach to Implicit Computational Complexity presenting different proposals for the class of polynomial time functions. We focus on the use of light logics in designing type systems for the Lambda Calculus considered as a core functional programming...
متن کامل